Refining Properties of Filter Models: Sensibility, Approximability and Reducibility

نویسنده

  • Flavien Breuvart
چکیده

In this paper, we study the tedious link between the properties of sensibility and approximability of models of untyped λ-calculus. Approximability is known to be a slightly, but strictly stronger property that sensibility. However, we will see that so far, each and every (filter) model that have been proven sensible are in fact approximable. We explain this result as a weakness of the sole known approach of sensibility: the Tait reducibility candidates and its realizability variants. In fact, we will reduce the approximability of a filter model D for the λ-calculus to the sensibility of D but for an extension of the λ-calculus that we call λ-calculus with D-tests. Then we show that traditional proofs of sensibility of D for the λcalculus are smoothly extendable for this λ-calculus with D-tests.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

ComputingStructure in Approximation Classes ?

The study of the approximability properties of NP-hard optimization problems has recently made great advances mainly due to the results obtained in the eld of proof checking. The last important breakthrough shows the APX-completeness of several important optimization problems is proved and thus reconciles`two distinct views of approximation classes: syntactic and computational'. In this paper w...

متن کامل

Hardness and Approximability in Multi-Objective Optimization

We systematically study the hardness and the approximability of combinatorial multiobjective NP optimization problems (multi-objective problems, for short). We define solution notions that precisely capture the typical algorithmic tasks in multiobjective optimization. These notions inherit polynomial-time Turing reducibility from multivalued functions, which allows us to compare the solution no...

متن کامل

On Self-Reducibility and Reoptimization of Closest Substring Problem

In this paper, we define the reoptimization variant of the closest substring problem (CSP) under sequence addition. We show that, even with the additional information we have about the problem instance, the problem of finding a closest substring is still NP-hard. We investigate the combinatorial property of optimization problems called self-reducibility. We show that problems that are polynomia...

متن کامل

EFFECT OF REFINING PROCESS ON POROSITY AND MECHANICAL PROPERTIES OF HIGH PRESSURE AL-SI ALLOY DIE CASTINGS

Abstract: This study presents the research results of effect that refining process has on porosity and mechanical properties of high pressure die castings made of AlSi12S alloy. The operation of refining was carried out in a melting furnace with the use of an FDU Mini Degasser. Mechanical properties (UTS, YS, Elongation, Brinell Hardness) were assessed on samples taken from high pressure die ca...

متن کامل

Structure in Approximation Classes

The study of the approximability properties of NP-hard optimization problems has recently made great advances mainly due to the results obtained in the field of proof checking. The last important breakthrough proves the APX-completeness of several important optimization problems and thus reconciles “two distinct views of approximation classes: syntactic and computational” [S. Khanna et al., in ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1801.05153  شماره 

صفحات  -

تاریخ انتشار 2018